Stack-based sorting algorithms

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stack-based sorting algorithms

The emergence of stacks as a hardware device in stack machines implies the recognition of the importance of using stacks in different computer applications and the need to make use of them in others. This paper uses stacks to solve the sorting problem. Two stack-based sorting algorithms are introduced. The first is based upon sorting by the insertion technique, whereas the second is based upon ...

متن کامل

A Survey of Stack-Sorting Disciplines

We review the various ways that stacks, their variations and their combinations, have been used as sorting devices. In particular, we show that they have been a key motivator for the study of permutation patterns. We also show that they have connections to other areas in combinatorics such as Young tableau, planar graph theory, and simplicial complexes.

متن کامل

Stack Sorting, Trees, and Pattern Avoidance

The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice through a stack (where the letters on the stack have to be in increasing order) was conjectured by West, and later proved by Zeilberger. Goulden and West found a...

متن کامل

An Improved Lower Bound for Stack Sorting

We consider the problem of sorting elements on a series of stacks, introduced by Tarjan and Knuth. We improve the asymptotic lower bound for the number of stacks necessary to sort n elements to 0.561 log 2 n+O(1). This is the first significant improvement since the previous lower bound, 1 2 log 2 n+O(1), was established by Knuth in 1972.

متن کامل

A Brief Introduction to Stack Sorting

The problem of stack sorting was introduced by Knuth in the 1960s. He described the stack sorting operation as the movement of railway cars across a railroad switching network. The problem is also similar to the childhood game of Hanoi Towers, in which the player is supposed to move concentric discs of varying sizes from one side across to another without placing a bigger disc above a smaller o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Systems and Software

سال: 1989

ISSN: 0164-1212

DOI: 10.1016/0164-1212(89)90042-3